#include "BSTree.hpp"

int main()
{
	BSTree<int> tree;
	tree.Insert(5);
	tree.Insert(7);
	tree.Insert(1);
	tree.Insert(9);
	tree.Insert(4);
	tree.Insert(23);
	tree.Insert(20);
	tree.Insert(21);
	tree.Insert(22);
	tree.Insert(43);
	tree.Insert(78);
	tree.Insert(53);

	BSTree<int> tree1(tree);
	BSTree<int> tree2;
	tree2 = tree;

	cout << tree.Find(78) << endl;
	cout << tree.Find(99) << endl;

	tree.Inorder();

	tree.Erase(23);

	tree.Inorder();
	tree1.Inorder();
	tree2.Inorder();
	return 0;
}